This paper arose out of the 2017 international conference on AI and law doctoral consortium. There were five students who presented their Ph.D. work, and each of them has contributed a section to this paper. The paper offers a view of what topics are currently engaging students, and shows the diversity of their interests and influences.

Increasing evidence indicates that extracellular vesicles (EVs) secreted from tumor cells play a key role in the overall progression of the disease state. EVs such as exosomes are secreted by a wide variety of cells and transport a varied population of proteins, lipids, DNA, and RNA species within the body. Gliomas constitute a significant proportion of all primary brain tumors and majority of brain malignancies. Glioblastoma multiforme (GBM) represents grade IV glioma and is associated with very poor prognosis despite the (...) cumulative advances in diagnostic procedures and treatment strategies. Here, the authors describe the progress in understanding the role of EVs, especially exosomes, in overall glioma progression, and how new research is unraveling the utilities of exosomes in glioma diagnostics and development of next‐generation therapeutic systems. Finally, based on an understanding of the latest scientific literature, a model for the possible working of therapeutic exosomes in glioma treatment is proposed. (shrink)

_Feminismo para el 99% Un Manifiesto_, __publicado mundialmente el 8 de marzo de 2019, pretende configurarse como una apuesta político-discursiva capaz de trascender, tanto en su aspecto literario como en su contenido político, fronteras y territorios. Nuestra versión en castellano, traducida del inglés original por Renata Prati, convive con cerca de veinte ediciones, localizadas en distintos países, distribuidas en distintas lenguas, y que reúnen a tres mujeres con trayectorias signadas tanto por la producción académica como por el activismo político. Entre (...) la multiplicidad de preguntas que aparecen a lo largo de las páginas, una parece destacarse: cuál es el sentido o, incluso, cuál es el _deber ser_ de un feminismo cuyo horizonte coincide con la emancipación. (shrink)

El uso prolongado de la voz es un factor de riesgo para el desarrollo de patologías vocales en docentes. Actualmente, estos profesionales se ven obligados a usar mascarilla para dictar sus clases, lo que puede resultar en alteraciones vocales. Durante la virtualización de las clases los docentes debieron adaptar algún espacio doméstico para desempeñar sus funciones frente a un computador, disminuyendo la actividad física y fomentando un estilo de vida sedentario, lo que pudo ocasionar algún trastorno músculo-esquelético. Con este panorama, (...) el propósito del estudio es identificar efectos en la voz por la mascarilla y lesiones músculo-esqueléticas en docentes. (shrink)

Dentre todas as possibilidades de ação feminista, há a militância em espaço público e a prática em apoio às mulheres, bem como a levada de consciência sobre pautas feministas para as mulheres, tanto no âmbito privado como no público. Esta era a abordagem de Andrea Dworkin, que proferia discursos em marchas e levava suas próprias experiências para o âmbito da escrita, sua prática profissional. A mesma abordagem era utilizada por Suzanne Lacy, artista contemporânea que, através de instalações urbanas, realizava suas (...) ações de militância combinada à arte. Este trabalho visa traçar parâmetros comuns entre estas duas mulheres, focando em suas pautas e na reverberação de seus trabalhos um em relação ao outro, bem como na sociedade.Palavras-chave: Público. Arte Contemporânea. Feminismo. AbstractAmongst all possibilities of feminist action there’s the militant strategy: to take the word of action into the public space, to act in women’s aid, to talk to your target audience and bring your discourse to the people. That was Andrea Dworkin’s strategy, who would bring her speeches into women’s marches and take her experience into her writing, which was her profession. The same strategy was taken by Suzanne Lacy, contemporary artist who focuses on urban installations to mix political and artistic action. This paper correlates these two authors, focusing on their preferred subjects and how their works reverberated together and in society.Keywords: Public. Contemporary Art. Feminism. (shrink)

Although not a professional historian, the author raises several issues pertinent to the state of history today.Qualifying the "non-historian" as an "able" interventionist in historical studies, the author explores the relationship between ...

Product Dimensions: 8.6 x 5.6 x 1.1 inches Description: Very little is known about the author of this book apart from the facts that he is a retired Government of India officer, now in his late nineties, apparently hoary, but healthy. When requested for more bio-data, he wrote back…The Real author of the Original Yoga is the Lord Siva. In the mundane world, Patanjali is the prime propagator of yoga. Any other claim to authorship, therefore, cannot but be spurious. …It (...) is Truth that matters, not the utterer of the Truth. No Truth ever becomes a bit truer even when repeated by the most distinguished person. …Hence all genuine aspirants of yoga should be content to remain unknown and unnoticed by others. His other published work is Hindu Concept of Life and Death. (shrink)

This paper investigates a connection between the semantic notion provided by the ordering * among theories in model theory and the syntactic SOPn hierarchy of Shelah. It introduces two properties which are natural extensions of this hierarchy, called SOP2 and SOP1. It is shown here that SOP3 implies SOP2 implies SOP1. In Shelah's article 229) it was shown that SOP3 implies *-maximality and we prove here that *-maximality in a model of GCH implies a property called SOP2″. It has been (...) subsequently shown by Shelah and Usvyatsov that SOP2″ and SOP2 are equivalent, so obtaining an implication between *-maximality and SOP2. It is not known if SOP2 and SOP3 are equivalent. Together with the known results about the connection between the SOPn hierarchy and the existence of universal models in the absence of GCH, the paper provides a step toward the classification of unstable theories without the strict order property. (shrink)

We survey the use of club guessing and other PCF constructs in the context of showing that a given partially ordered class of objects does not have a largest, or a universal, element.

If κ is any strongly unfoldable cardinal, then this is preserved in a forcing extension in which κ fails. This result continues the progression of the corresponding results for weakly compact cardinals, due to Woodin, and for indescribable cardinals, due to Hauser.

The paper is concerned with the existence of a universal graph at the successor of a strong limit singular μ of cofinality ℵ0. Starting from the assumption of the existence of a supercompact cardinal, a model is built in which for some such μ there are $\mu^{++}$ graphs on μ+ that taken jointly are universal for the graphs on μ+, while $2^{\mu^+} \gg \mu^{++}$ . The paper also addresses the general problem of obtaining a framework for consistency results at the (...) successor of a singular strong limit starting from the assumption that a supercompact cardinal κ exists. The result on the existence of universal graphs is obtained as a specific application of a more general method. (shrink)

Suppose that λ is the successor of a singular cardinal μ whose cofinality is an uncountable cardinal κ. We give a sufficient condition that the club filter of λ concentrating on the points of cofinality κ is not λ+-saturated.1 The condition is phrased in terms of a notion that we call weak reflection. We discuss various properties of weak reflection. We introduce a weak version of the ♣-principle, which we call ♣*−, and show that if it holds on a stationary (...) subset S of λ, then no normal filter on S is λ+-saturated. Under the above assumptions, ♣*− is true for any stationary subset S of λ which does not contain points of cofinality κ. For stationary sets S which concentrate on points of cofinality κ, we show that ♣*− holds modulo an ideal obtained through the weak reflection. (shrink)

Suppose that λ=λ <λ ≥ℵ0, and we are considering a theory T. We give a criterion on T which is sufficient for the consistent existence of λ++ universal models of T of size λ+ for models of T of size ≤λ+, and is meaningful when 2λ +>λ++. In fact, we work more generally with abstract elementary classes. The criterion for the consistent existence of universals applies to various well known theories, such as triangle-free graphs and simple theories. Having in mind (...) possible applications in analysis, we further observe that for such λ, for any fixed μ>λ+ regular with μ=μλ+, it is consistent that 2λ=μ and there is no normed vector space over ℚ of size <μ which is universal for normed vector spaces over ℚ of dimension λ+ under the notion of embedding h which specifies (a,b) such that ||h(x)/||x∈(a,b) for all x. (shrink)

Since the conceptualization of unethical pro-organizational behavior ten years ago, scholarly interest in exploring this phenomenon has multiplied. Given a burgeoning body of empirical research, a review of unethical pro-organizational behavior literature is warranted. This study, therefore, systematically reviews the extant literature on unethical pro-organizational behavior and presents a comprehensive theory-based review of the past developments in this field. We classify previous studies based on their underlying theoretical perspectives and discuss the antecedents and consequences of unethical pro-organizational behavior in work (...) context. We also explicate the boundary conditions under which the influence of these antecedents gets accentuated or alleviated. Overall, this study synthesizes past knowledge to elucidate why, how, and when unethical pro-organizational behavior unfolds in the workplace. Finally, the gaps in the extant theorization are identified and an agenda for future research is proposed. (shrink)

We consider various versions of the ♣ principle. This principle is a known consequence of $\lozenge$ . It is well known that $\lozenge$ is not sensitive to minor changes in its definition, e.g., changing the guessing requirement form "guessing exactly" to "guessing modulo a finite set". We show however, that this is not true for ♣. We consider some other variants of ♣ as well.

We prove consistent, assuming there is a supercompact cardinal, that there is a singular strong limit cardinal $\mu$ , of cofinality $\omega$ , such that every $\mu^{+}$ -chromatic graph X on $\mu^{+}$ has an edge colouring c of X into $\mu$ colours for which every vertex colouring g of X into at most $\mu$ many colours has a g-colour class on which c takes every value. The paper also contains some generalisations of the above statement in which $\mu^{+}$ is replaced (...) by other cardinals < $\mu$. (shrink)

This book, published in 2019 as an open-access edition of the Fordham University Press, attracts by its title. Imagination, as we mathematicians know only too w.

In the domain of legal information retrieval, an important challenge is to compute similarity between two legal documents. Precedents play an important role in The Common Law system, where lawyers need to frequently refer to relevant prior cases. Measuring document similarity is one of the most crucial aspects of any document retrieval system which decides the speed, scalability and accuracy of the system. Text-based and network-based methods for computing similarity among case reports have already been proposed in prior works but (...) not without a few pitfalls. Since legal citation networks are generally highly disconnected, network based metrics are not suited for them. Till date, only a few text-based and predominant embedding based methods have been employed, for instance, TF-IDF based approaches, Word2Vec and Doc2Vec based approaches. We investigate the performance of 56 different methodologies for computing textual similarity across court case statements when applied on a dataset of Indian Supreme Court Cases. Among the 56 different methods, thirty are adaptations of existing methods and twenty-six are our proposed methods. The methods studied include models such as BERT and Law2Vec. It is observed that the more traditional methods that rely on a bag-of-words representation performs better than the more advanced context-aware methods for computing document-level similarity. Finally we nominate, via empirical validation, five of our best performing methods as appropriate for measuring similarity between case reports. Among these five, two are adaptations of existing methods and the other three are our proposed methods. (shrink)

We introduce the oak property of first order theories, which is a syntactical condition that we show to be sufficient for a theory not to have universal models in cardinality λ when certain cardinal arithmetic assumptions about λ implying the failure of GCH hold. We give two examples of theories that have the oak property and show that none of these examples satisfy SOP4, not even SOP3. This is related to the question of the connection of the property SOP4 to (...) non-universality, as was raised by the earlier work of Shelah. One of our examples is the theory for which non-universality results similar to the ones we obtain are already known; hence we may view our results as an abstraction of the known results from a concrete theory to a class of theories. We show that no theory with the oak property is simple. (shrink)

Let κ be a singular cardinal. Karp's notion of a chain model of size κ is defined to be an ordinary model of size κ along with a decomposition of it into an increasing union of length cf. With a notion of satisfaction and -isomorphism such models give an infinitary logic largely mimicking first order logic. In this paper we associate to this logic a notion of a dynamic EF-game which gauges when two chain models are chain-isomorphic. To this game (...) is associated a tree which is a tree of size κ with no κ-branches -branches). The measure of how non-isomorphic the models are is reflected by a certain order on these trees, called reduction. We study the collection of trees of size κ with no κ-branches under this notion and prove that when cf = ω this collection is rather regular; in particular it has universality number exactly κ+. Such trees are then used to develop a descriptive set theory of the space cf κ. The main result of the paper gives in the case of κ strong limit singular an exact connection between the descriptive set-theoretic complexity of the chain isomorphism orbit of a model, the reduction order on the trees and winning strategies in the corresponding dynamic EF games. In particular we obtain a neat analog of the notion of Scott watershed from the Scott analysis of countable models. (shrink)

A wide Aronszajn tree is a tree of size and height $\omega _{1}$ with no uncountable branches. We prove that under $MA$ there is no wide Aronszajn tree which is universal under weak embeddings. This solves an open question of Mekler and Väänänen from 1994. We also prove that under $MA$, every wide Aronszajn tree weakly embeds in an Aronszajn tree, which combined with a result of Todorčević from 2007, gives that under $MA$ every wide Aronszajn tree embeds into a (...) Lipschitz tree or a coherent tree. We also prove that under $MA$ there is no wide Aronszajn tree which weakly embeds all Aronszajn trees, improving the result in the first paragraph as well as a result of Todorčević from 2007 who proved that under $MA$ there are no universal Aronszajn trees. (shrink)

We investigate strictly positive finitely additive measures on Boolean algebras and strictly positive Radon measures on compact zerodimensional spaces. The motivation is to find a combinatorial characterisation of Boolean algebras which carry a strictly positive finitely additive finite measure with some additional properties, such as separability or nonatomicity. A possible consistent characterisation for an algebra to carry a separable separable positive measure was suggested by Talagrand in 1980, which is that the Stone space K of the algebra satisfies that its (...) space M(K) of measures is weakly separable, equivalently that C(K) embeds into l∞. We show that there is a ZFC example of a Boolean algebra (so of a compact space) which satisfies this condition and does not support a separable strictly positive measure. However, we use this property as a tool in a proof which shows that under MA+⇁ CH every atomless ccc Boolean algebra of size < c carries a nonatomic strictly positive measure. Examples are given to show that this result does not hold in ZFC. Finally, we obtain a characterisation of Boolean algebras that carry a strictly positive nonatomic measure in terms of a chain condition, and we draw the conclusion that under MA+⇁ CH every atomless ccc Boolean algebra satisfies this stronger chain condition. (shrink)

We discuss a simple logic to describe one of our favourite games from childhood, hide and seek, and show how a simple addition of an equality constant to describe the winning condition of the seeker makes our logic undecidable. There are certain decidable fragments of first-order logic which behave in a similar fashion and we add a new modal variant to that class of logics. We also discuss the relative expressive power of the proposed logic in comparison to the standard (...) modal counterparts. (shrink)

When agents know a protocol, this leads them to have expectations about future observations. Agents can update their knowledge by matching their actual observations with the expected ones. They eliminate states where they do not match. In this paper, we study how agents perceive protocols that are not commonly known, and propose a semantics-driven logical framework to reason about knowledge in such scenarios. In particular, we introduce the notion of epistemic expectation models and a propositional dynamic logic-style epistemic logic for (...) reasoning about knowledge via matching agentsÊ expectations to their observations. It is shown how epistemic expectation models can be obtained from epistemic protocols. Furthermore, a characterization is presented of the effective equivalence of epistemic protocols. We introduce a new logic that incorporates updates of protocols and that can model reasoning about knowledge and observations. Finally, the framework is extended to incorporate fact-changing actions, and a worked-out example is given. © 2013 Elsevier B.V. (shrink)

We make a proposal for formalizing simultaneous games at the abstraction level of player’s powers, combining ideas from dynamic logic of sequential games and concurrent dynamic logic. We prove completeness for a new system of ‘concurrent game logic’ CDGL with respect to finite non-determined games. We also show how this system raises new mathematical issues, and throws light on branching quantifiers and independence-friendly evaluation games for first-order logic.

In a Common Law system, legal practitioners need frequent access to prior case documents that discuss relevant legal issues. Case documents are generally very lengthy, containing complex sentence structures, and reading them fully is a strenuous task even for legal practitioners. Having a concise overview of these documents can relieve legal practitioners from the task of reading the complete case statements. Legal catchphrases are (multi-word) phrases that provide a concise overview of the contents of a case document, and automated generation (...) of catchphrases is a challenging problem in legal analytics. In this paper, we propose a novel supervised neural sequence tagging model for the extraction of catchphrases from legal case documents. Specifically, we show that incorporating document-specific information along with a sequence tagging model can enhance the performance of catchphrase extraction. We perform experiments over a set of Indian Supreme Court case documents, for which the gold-standard catchphrases (annotated by legal practitioners) are obtained from a popular legal information system. The performance of our proposed method is compared with that of several existing supervised and unsupervised methods, and our proposed method is empirically shown to be superior to all baselines. (shrink)

The task of rhetorical role labeling is to assign labels (such as Fact, Argument, Final Judgement, etc.) to sentences of a court case document. Rhetorical role labeling is an important problem in the field of Legal Analytics, since it can aid in various downstream tasks as well as enhances the readability of lengthy case documents. The task is challenging as case documents are highly various in structure and the rhetorical labels are often subjective. Previous works for automatic rhetorical role identification (...) (i) mainly used Conditional Random Fields over manually handcrafted features, and (ii) focused on certain law domains only (e.g., Immigration cases, Rent law), and a particular jurisdiction/country (e.g., US, Canada, India). In this work, we improve upon the prior works on rhetorical role identification by proposing novel Deep Learning models for automatically identifying rhetorical roles, which substantially outperform the prior methods. Additionally, we show the effectiveness of the proposed models over documents from five different law domains, and from two different jurisdictions—the Supreme Court of India and the Supreme Court of the UK. Through extensive experiments over different variations of the Deep Learning models, including Transformer models based on BERT and LegalBERT, we show the robustness of the methods for the task. We also perform an extensive inter-annotator study and analyse the agreement of the predictions of the proposed model with the annotations by domain experts. We find that some rhetorical labels are inherently hard/subjective and both law experts and neural models frequently get confused in predicting them correctly. (shrink)

We give a construction of the square principle by means of forcing with finite conditions.

We show the relative consistency of ℵ1 satisfying a combinatorial property considered by David Fremlin (in the question DU from his list) in certain choiceless inner models. This is demonstrated by first proving the property is true for Ramsey cardinals. In contrast, we show that in ZFC, no cardinal of uncountable cofinality can satisfy a similar, stronger property. The questions considered by D. H. Fremlin are if families of finite subsets of ω1 satisfying a certain density condition necessarily contain all (...) finite subsets of an infinite subset of ω1, and specifically if this and a stronger property hold under MA + ¬CH. Towards this we show that if MA + ¬CH holds, then for every family ? of ℵ1 many infinite subsets of ω1, one can find a family ? of finite subsets of ω1 which is dense in Fremlins sense, and does not contain all finite subsets of any set in ?.We then pose some open problems related to the question. (shrink)

The Transforming growth factor beta (TGF‐β) family of secreted proteins regulates a variety of key events in normal development and physiology. In mammals, this family, represented by 33 ligands, including TGF‐β, activins, nodal, bone morphogenetic proteins (BMPs), and growth and differentiation factors (GDFs), regulate biological processes as diverse as cell proliferation, differentiation, apoptosis, metabolism, homeostasis, immune response, wound repair, and endocrine functions. In Drosophila, only 7 members of this family are present, with 4 TGF‐β/BMP and 3 TGF‐β/activin ligands. Studies in (...) the fly have illustrated the role of TGF‐β/BMP ligands during embryogenesis and organ patterning, while the TGF‐β/activin ligands have been implicated in the control of wing growth and neuronal functions. In this review, we focus on the emerging roles of Drosophila TGF‐β/activins in inter‐organ communication via long‐distance regulation, especially in systemic lipid and carbohydrate homeostasis, and discuss findings relevant to metabolic diseases in humans. -/- . (shrink)

The status of independent statements is the main problem in the philosophy of set theory. We address this problem by presenting the perspective of a practising set theorist. We thus give an authentic insight in the current state of thinking in set-theoretic practice, which is to a large extent determined by independence results. During several meetings, the second author asked the first author about the development of forcing, the use of new axioms and set-theoretic intuition on independence. Parts of these (...) conversations are directly presented in this article. They are supplemented by important mathematical results as well as discussion sections. Finally, we present three hypotheses about set-theoretic practice: First, that most set theorists were surprised by the introduction of the forcing method. Second, that most set theorists think that forcing is a natural part of contemporary set theory. Third, that most set theorists prefer an answer to a problem with the help of a new axiom of lowest possible consistency strength, and that for most set theorists, a difference in consistency strength weighs much more than the difference between Forcing Axiom and Large Cardinal Axiom. (shrink)

Connected vehicle fleets have formed significant component of industrial internet of things scenarios as part of Industry 4.0 worldwide. The number of vehicles in these fleets has grown at a steady pace. The vehicles monitoring with machine learning algorithms has significantly improved maintenance activities. Predictive maintenance potential has increased where machines are controlled through networked smart devices. Here, benefits are accrued considering uptimes optimization. This has resulted in reduction of associated time and labor costs. It has also provided significant increase (...) in cost benefit ratios. Considering vehicle fault trends in this research predictive maintenance problem is addressed through hybrid deep learning-based ensemble method (HDLEM). The ensemble framework which acts as predictive analytics engine comprises of three deep learning algorithms viz modified cox proportional hazard deep learning (MCoxPHDL), modified deep learning embedded semi supervised learning (MDLeSSL) and merged LSTM (MLSTM) networks. Both sensor as well as historical maintenance data are collected and prepared using benchmarking methods for HDLEM training and testing. Here, times between failures (TBF) modeling and prediction on multi-source data are successfully achieved. The results obtained are compared with stated deep learning models. This ensemble framework offers great potential towards achieving more profitable, efficient and sustainable vehicle fleet management solutions. This helps better telematics data implementation which ensures preventative management towards desired solution. The ensemble method's superiority is highlighted through several experimental results. (shrink)

Summarization of legal case judgement documents is a practical and challenging problem, for which many summarization algorithms of different varieties have been tried. In this work, rather than developing yet another summarization algorithm, we investigate if intelligently ensembling (combining) the outputs of multiple (base) summarization algorithms can lead to better summaries of legal case judgements than any of the base algorithms. Using two datasets of case judgement documents from the Indian Supreme Court, one with extractive gold standard summaries and the (...) other with abstractive gold standard summaries, we apply various ensembling techniques on summaries generated by a wide variety of summarization algorithms. The ensembling methods applied range from simple voting-based methods to ranking-based and graph-based ensembling methods. We show that many of our ensembling methods yield summaries that are better than the summaries produced by any of the individual base algorithms, in terms of ROUGE and METEOR scores. (shrink)